Bayesian network variable elimination method optimal elimination order construction

Variable Elimination (VE) is the most basic one of many Bayesian network inference algorithms. The speed and complexity reasoning mainly depend on order elimination. Finding optimal elimination a Nondeterministic Polynomial Hard (NP-Hard) problem, which often solved by heuristic search in practice. In to improve variable method, minimum, maximum potential, minimum missing edge added methods are studied. Asian taken as an example analyze calculate above method. Meta-order, through MATLAB R2018a, different were constructed reasoned separately. Finally, performance four was compared time analysis. experimental results show that increase method better than other methods, average consuming at least 0.012s, can up process network.